Partitions of an Integer into Powers
نویسنده
چکیده
In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In particular, we show that the set of these partitions can be ordered in a natural way which gives the distributive lattice structure to this set. We also give a tree structure which allow efficient and simple enumeration of the partitions of an integer.
منابع مشابه
ARITHMETIC PROPERTIES OF m–ARY PARTITIONS WITHOUT GAPS
Motivated by recent work of Bessenrodt, Olsson, and Sellers on unique path partitions, we consider partitions of an integer n wherein the parts are all powers of a fixed integer m ≥ 2 and there are no “gaps” in the parts; that is, if m is the largest part in a given partition, then m also appears as a part in the partition for each 0 ≤ j < i. Our ultimate goal is to prove an infinite family of ...
متن کاملLimit Theorems for the Number of Summands in Integer Partitions
Central and local limit theorems are derived for the number of distinct summands in integer partitions, with or without repetitions, under a general scheme essentially due to Meinardus. The local limit theorems are of the form of Cramér-type large deviations and are proved by Mellin transform and the two-dimensional saddle-point method. Applications of these results include partitions into posi...
متن کاملA different view of m-ary partitions
In 1969, R. F. Churchhouse [2] studied the number of binary partitions of an integer n. That is, Churchhouse proved various properties of the partition function b2(n), which counts the number of partitions of n into parts which are powers of 2. Soon after, Andrews [1], Gupta [4–6], and Rodseth [7] extended Churchhouse’s results. They considered a generalization of b2(n), which we will denote bm...
متن کاملImproved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کاملGraham's Tree Reconstruction Conjecture and a Waring-Type Problem on Partitions
Suppose G is a tree. Graham’s “Tree Reconstruction Conjecture” states that G is uniquely determined by the integer sequence |G|, |L(G)|, |L(L(G))|, |L(L(L(G)))|, . . ., where L(H) denotes the line graph of the graph H . Little is known about this question apart from a few simple observations. We show that the number of trees on n vertices which can be distinguished by their associated integer s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001